Fast Radial Basis Function Interpolation via Preconditioned Krylov Iteration

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Radial Basis Function Interpolation via Preconditioned Krylov Iteration

We consider a preconditioned Krylov subspace iterative algorithm presented by Faul et al. (IMA Journal of Numerical Analysis (2005) 25, 1—24) for computing the coefficients of a radial basis function interpolant over N data points. This preconditioned Krylov iteration has been demonstrated to be extremely robust to the distribution of the points and the iteration rapidly convergent. However, th...

متن کامل

Krylov Subspace Methods for Radial Basis Function Interpolation 1

Radial basis function methods for interpolation to values of a function of several variables are particularly useful when the data points are in general positions, but hardly any sparsity occurs in the matrix of the linear system of interpolation equations. Therefore an iterative procedure for solving the system is studied. The k-th iteration calculates the element in a k-dimensional linear sub...

متن کامل

Grade Interpolation Using Radial Basis Function Networks

This paper analyses the application of Radial Basis Function (RBF) networks in grade interpolation. These networks are a very unique member of the family of Artificial Neural Networks. RBF networks have such theoretical properties that establish them as a potential alternative to existing grade interpolation techniques. Their suitability to the problem of grade interpolation will be demonstrate...

متن کامل

A new stable basis for radial basis function interpolation

It is well-known that radial basis function interpolants suffer of bad conditioning if the basis of translates is used. In the recent work [12], the authors gave a quite general way to build stable and orthonormal bases for the native space NΦ(Ω) associated to a kernel Φ on a domain Ω ⊂ Rs. The method is simply based on the factorization of the corresponding kernel matrix. Starting from that se...

متن کامل

A new trust-region algorithm based on radial basis function interpolation

Optimization using radial basis functions as an interpolation tool in trust-region (ORBIT), is a derivative-free framework based on fully linear models to solve unconstrained local optimization, especially when the function evaluations are computationally expensive. This algorithm stores the interpolation points and function values to using at subsequent iterations. Despite the comparatively ad...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 2007

ISSN: 1064-8275,1095-7197

DOI: 10.1137/060662083